Fast approximate shortest paths in the congested clique
نویسندگان
چکیده
منابع مشابه
Approximate Shortest Descending Paths
We present an approximation algorithm for the shortest descending path problem. Given a source s and a destination t on a terrain, a shortest descending path from s to t is a path of minimum Euclidean length on the terrain subject to the constraint that the height decreases monotonically as we traverse that path from s to t. Given any ε ∈ (0, 1), our algorithm returns in O(n log(n/ε)) time a de...
متن کاملApproximate Shortest Homotopic Paths in Weighted Regions
Let P be a path between two points s and t in a polygonal subdivision T with obstacles and weighted regions. Given a relative error tolerance ε ∈ (0, 1), we present the first algorithm to compute a path between s and t that can be deformed to P without passing over any obstacle and the path cost is within a factor 1+ ε of the optimum. The running time is O( 3 ε2 knpolylog(k, n, 1 ε )), where k ...
متن کاملApproximate shortest paths in weighted graphs
We present an approximation algorithm for the all pairs shortest paths (APSP) problem in weighed graphs. Our algorithm solves the APSP problem for weighted directed graphs, with real (positive or negative) weights, up to an additive error of . For any pair of vertices u, v, the algorithm finds a path whose length is at most δ(u, v) + . The algorithm is randomized and runs in Õ(n) < O(n) time, w...
متن کاملApproximate shortest paths in moderately anisotropic regions
We want to find an approximate shortest path for a point robot moving in a planar subdivision. Each face of the subdivision is associated with a convex distance function that has the following property: its unit disk contains a unit Euclidean disk, and is contained in a Euclidean disk with radius ρ. Obstacles are allowed, so there can be regions that the robot is not allowed to enter. We give a...
متن کاملApproximate Shortest Paths in Simple Polyhedra
Introduction Minimal paths in volume images have raised interest in computer vision and image analysis (for example, [4, 5]). In medical image analysis, minimal paths were extracted in 3D images and applied to virtual endoscopy [5]. The existed approximation algorithms for 3D ESP calculations are not efficient, see, for example, [2, 6]. Recently, [1] proposes algorithms for calculating approxim...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Distributed Computing
سال: 2020
ISSN: 0178-2770,1432-0452
DOI: 10.1007/s00446-020-00380-5